Design of Fixed and Ladder Mutation Factor-Based Clonal Selection Algorithm for Solving Unimodal and Multimodal Functions

نویسندگان

  • Suresh Chittineni
  • A. N. S. Pradeep
  • Dinesh Godavarthi
  • Suresh Chandra Satapathy
  • S. Mohan Krishna
  • P. V. G. D. Prasad Reddy
چکیده

Clonal selection algorithms (CSAs) is a special class of immune algorithms (IA), inspired by the clonal selection principle of the human immune system. To improve the algorithm’s ability to perform better, this CSA has been modified by implementing two new concepts called fixed mutation factor and ladder mutation factor. Fixed mutation factor maintains a constant factor throughout the process, where as ladder mutation factor changes adaptively based on the affinity of antibodies. This paper compared the conventional CLONALG, with the two proposed approaches and tested on several standard benchmark functions. Experimental results empirically show that the proposed methods ladder mutation-based clonal selection algorithm (LMCSA) and fixed mutation clonal selection algorithm (FMCSA) significantly outperform the existing CLONALG method in terms of quality of the solution, convergence speed, and solution stability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

STRUCTURAL OPTIMIZATION USING A MUTATION-BASED GENETIC ALGORITHM

The present study is an attempt to propose a mutation-based real-coded genetic algorithm (MBRCGA) for sizing and layout optimization of planar and spatial truss structures. The Gaussian mutation operator is used to create the reproduction operators. An adaptive tournament selection mechanism in combination with adaptive Gaussian mutation operators are proposed to achieve an effective search in ...

متن کامل

Solving the tandem AGV network design problem using tabu search: Cases of maximum workload and workload balance with fixed and non-fixed number of loops

A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...

متن کامل

Optimum sliding mode controller design based on skyhook model for nonlinear vehicle vibration model

In this paper a new type of multi-objective differential evolution employing dynamically tunable mutation factor is used to optimally design non-linear vehicle model. In this way, non-dominated sorting algorithm with crowding distance criterion are combined to fuziified mutation differential evolution to construct multi-objective algorithm to solve the problem. In order to achieve fuzzified mut...

متن کامل

Optimum Pareto design of vehicle vibration model excited by non-stationary random road using multi-objective differential evolution algorithm with dynamically adaptable mutation factor

In this paper, a new version of multi-objective differential evolution with dynamically adaptable mutation factor is used for Pareto optimization of a 5-degree of freedom vehicle vibration model excited by non-stationary random road profile. In this way, non-dominated sorting algorithm and crowding distance criterion have been combined to differential evolution with fuzzified mutation in order ...

متن کامل

Solving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over

Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Comp. Int. Soft Computing

دوره 2011  شماره 

صفحات  -

تاریخ انتشار 2011